Towards scaling laws in random polycrystals
نویسندگان
چکیده
Article history: Available online xxxx
منابع مشابه
Rise of Correlations of Transformation Strains in Random Polycrystals
Abstract. We investigate the statistics of the transformation-strains that arise in random martensitic polycrystals as boundary conditions cause its component crystallites to undergo martensitic phase transitions. In our one-dimensional polycrystal model the orientation of the n grains is given by an uncorrelated random array of the orientation angles θi, i = 1, . . . , n. Under imposed boundar...
متن کاملCapacity-Delay Scaling in Arbitrary Wireless Networks
Gupta and Kumar (2000) studied capacity scaling in random wireless networks with n nodes under the protocol interference model. They showed that the per source-destination pair capacity scales as Θ(1/ √ n logn) when n distinct random source-destination pairs communicate simultaneously. For the same setup, El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay scales as Θ( √ n/ logn)....
متن کاملThe Operator Ν-stable Laws
Operator stable laws are the limits of operator normed and centered sums of independent, identically distributed random vectors. The operator ν-stable laws are the analogous limit distributions for randomized sums. In this paper we characterize operator ν-stable laws and their domains of attraction. We also discuss several applications, including the scaling limits of continuous time random wal...
متن کاملVariance scaling of Boolean random varieties
Long fibers or stratified media show very long range correlations. This media can be simulated by models of Boolean random varieties. We study for these models the non standard scaling laws of the variance of the local volume fraction with the volume of domains K: on a large scale, a the variance of the local volume fraction decreases with power laws of the volume of K. The exponent γ is equal ...
متن کاملEnergy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed according to a general spatial distribution in an expanding region. Among the class of data fusion schemes that enable optimal inference at the fusion center for Markov random field hypotheses, the minimum per-sensor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009